Description logic for coalitions
نویسندگان
چکیده
Coalition Logic (CL) is one of the most important formalisms for specification and verification of game-like multi-agent systems. Several extensions of the logic have been studied in the literature. These extensions are usually fusions (independent joins) of CL with other modal logics (e.g., temporal, epistemic, dynamic, etc.), and they are generally propositional. In this paper, we propose a game description logic called CLALC which is based on a product of Coalition Logic with the description logic ALC. The new logic allows one to reason about agents’ ability to influence firstorder structures. We show that the satisfiability problem for CLALC is decidable; we prove this by giving a goal-directed decision procedure for the problem.
منابع مشابه
Coalition Description Logic with Individuals
Coalition logic (CL) [12] formalizes the ability of groups of agents to achieve certain outcomes in strategic games. The central operator of the logic is [A], with [A]φ meaning that group of agents A has a strategy to achieve an outcome state where φ holds. On the other hand, description logics (DLs) are logical formalisms for representing the knowledge of an application domain in a structured ...
متن کاملAlternating-time dynamic logic
We propose Alternating-time Dynamic Logic (ADL) as a multi-agent variant of Dynamic Logic in which atomic programs are replaced by coalitions. In ADL, the Dynamic Logic operators are parametrised with regular expressions over coalitions and tests. Such regular expressions describe the dynamic structure of a coalition. This means that, when moving from Dynamic Logic to ADL, the focus shifts away...
متن کاملAlgorithms for finding coalitions exploiting a new reciprocity condition
We introduce a reciprocity criterion for coalition formation among goal-directed agents, which we call the indecomposable do-ut-des property. It refines an older reciprocity property, called the do-ut-des or give-to-get property by considering the fact that agents prefer to form coalitions whose components cannot be formed independently. A formal description of this property is provided as well...
متن کاملSocial Viewpoints for Arguing about Coalitions
Frameworks for arguing about coalitions are based on non-monotonic logic and are therefore formal and abstract, whereas social theories about agent coalitions typically are based on conceptual modeling languages and therefore semi-formal and detailed. In this paper we bridge the gap between these two research areas such that social viewpoints can be used to argue about coalitions. We formally d...
متن کاملA Logic for Coalitions with Bounded Resources
Recent work on Alternating-Time Temporal Logic and Coalition Logic has allowed the expression of many interesting properties of coalitions and strategies. However there is no natural way of expressing resource requirements in these logics. This paper presents a Resource-Bounded Coalition Logic (RBCL) which has explicit representation of resource bounds in the language, and gives a complete and ...
متن کامل